Consequences of an exotic definition for P=NP

نویسندگان

  • Newton C. A. da Costa
  • Francisco A. Doria
چکیده

We introduce a formal sentence noted ½P ¼ NP Š

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the metamathematics of the P vs. NP question

We review the work (from 1976 to 1996) by several researchers on the metamathematics of P vs. NP. That work points towards the possibility that, given some strong consistent axiomatic system S with a recursively enumerable set of theorems which includes arithmetic, for the R2 sentence 1⁄2P 1⁄4 NP that formalizes the P 1⁄4 NP hypothesis, S þ 1⁄2P 1⁄4 NP is consistent. We consider the work of sev...

متن کامل

A review of the biological characteristics of ornamental and exotic giant snakeheadexotic, Channa micropeltes (Cuvier, 1831), reported from Anzali Wetland

The present work was conducted to study the biological characteristics of giant snakehead, Channa micropeltes, a popular ornamental species in the world. This species is native to Southeast Asia and also is distributed in Thailand, Laos (Mekong Basin), Vietnam, Malaysia, Sumatra (Bangka and Belitung Islands), Kalimantan and northern Java. Among the environmental characteristics, vegetation play...

متن کامل

2 P vs . NP and Diagonalization

2.1 3SAT is NP–hard Definition 2.1 (the class NP). L ⊂ {0, 1}∗ is in the class of NP if there exists a polynomial p : N→ N and a Turing machine M (called the verifier for L) such that for every x ∈ {0, 1}∗, x ∈ L ⇔ ∃y ∈ {0, 1}p(|x|) such that M(x, y) = 1. If x ∈ L and y ∈ {0, 1}p(|x|) satisfy M(x, y) = 1, then we call y a certificate/witness for x (with respect to the language L and machine M)....

متن کامل

A Proof for P =? NP Problem

The P =? NP problem is an important problem in contemporary mathematics and theoretical computer science. Many proofs have been proposed to this problem. This paper proposes a theoretic proof for P =? NP problem. The central idea of this proof is a recursive definition for Turing machine (shortly TM) that accepts the encoding strings of valid TMs. By the definition, an infinite sequence of TM i...

متن کامل

Methodology of conceptual review in the health system

Background: Conceptual review is a creative research method for generating new knowledge in the context of a vague and complex concept that helps to explain and clarify the concept, its components and its relation to related concepts. This study aimed to explain the methodology of conceptual review in the health system. Methods: Articles related to the conceptual research method were searched ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 145  شماره 

صفحات  -

تاریخ انتشار 2003